граф именования
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
Product naming — is the discipline of deciding what a product will be called, and is very similar in concept and approach to the process of deciding on a name for a company or organization. Product naming is considered a critical part of the branding process,… … Wikipedia
граф именования — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN naming graph … Справочник технического переводчика
Christmas Price Index — True Cost of Christmas, 1984 2009 Christmas Price Index ( … Wikipedia
Cyclomatic complexity — (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
Fullerene — Buckminsterfullerene C60 (left) and carbon nanotubes (right) are two examples of structures in the fullerene family … Wikipedia
Monosaccharide nomenclature — is a set of conventions used in chemistry to name the compounds known as monosaccharides or simple sugars the basic structural units of carbohydrates, which cannot be hydrolysed into simpler units.[1] Contents 1 Systematic name of molecular graph … Wikipedia
Electrocardiography — ECG redirects here. For other uses, see ECG (disambiguation). Not to be confused with echocardiogram, electromyogram, electroencephalogram, or EEG. Electrocardiography Intervention Image showing a patient connected to the 10 electrodes necessary … Wikipedia
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … Wikipedia
List of important publications in mathematics — One of the oldest surviving fragments of Euclid s Elements, found at Oxyrhynchus and dated to circa AD 100. The diagram accompanies Book II, Proposition 5.[1] This is a list of important publications in mathematics, organized by field. Some… … Wikipedia
RDFLib — Infobox Software name = RDFLib developer = Daniel Krech latest release version = 2.4.0 latest release date = April 4, 2007 operating system = Cross platform genre = Library license = BSD website = [http://rdflib.net/ http://rdflib.net/] RDFLib is … Wikipedia
